 |
Injective function Totally Explained
|
|  |
|
FOR SALE! | Either this or the left-hand panel are available for just $19.95 per day, or you can have both for only $34.95! Contact us for details.
|
Everything about Injection Mathematics totally explained
In mathematics, an injective function is a function which associates distinct arguments with distinct values.
An injective function is called an injection, and is also said to be an information-preserving or one-to-one function (the latter isn't to be confused with one-to-one correspondence, for example a bijective function).
A function f that isn't injective is sometimes called many-to-one. (However, this terminology is also sometimes used to mean "single-valued", for example each argument is mapped to at most one value.)
Definition
Let f be a function whose domain is a set A. It is injective if, for all a and b in A such that f( a)= f( b), we've a = b.
Examples and counter-examples
- For any set X, the identity function on X is injective.
- The function f : R → R defined by f(x) = 2x + 1 is injective.
- The function g : R → R defined by g(x) = x2 is not injective, because (for example) g(1) = 1 = g(−1). However, if g is redefined so that its domain is the non-negative real numbers [0,+∞),then g is injective.
- The exponential function
Other properties
If f and g are both injective, then f o g is injective.
If g o f is injective, then f is injective (but g need not be).
f : X → Y is injective if and only if, given any functions g, h : W → X, whenever f o g = f o h, then g = h. In other words, injective functions are precisely the monomorphisms in the category Set of sets.
If f : X → Y is injective and A is a subset of X, then f −1(f(A)) = A. Thus, A can be recovered from its image f(A).
If f : X → Y is injective and A and B are both subsets of X, then f(A ∩ B) = f(A) ∩ f(B).
Every function h : W → Y can be decomposed as h = f o g for a suitable injection f and surjection g. This decomposition is unique up to isomorphism, and f may be thought of as the inclusion function of the range h(W) of h as a subset of the codomain Y of h.
If f : X → Y is an injective function, then Y has at least as many elements as X, in the sense of cardinal numbers.
If both X and Y are finite with the same number of elements, then f : X → Y is injective if and only if f is surjective.
Every embedding is injective.Further Information
Get more info on 'Injection Mathematics'.
|
External Link Exchanges
Do you know how hard it is to get a link from a large encyclopaedia? Well we're different and will prove it. To get a link from us just add the following HTML to your site on a relevant page:
<a href="http://injective_function.totallyexplained.com">Injective function Totally Explained</a>
Then simply click through this link from your web page. Our crawlers will verify your link, extract the title of your web page and instantly add a link back to it. If you like you can remove the words Totally Explained and embed the link in article text.
As long as your link remains in place, we'll keep our link to you right here. Please play fair - our crawlers are watching. Your site must be closely related to this one's topic. Any kind of spamming, dubious practises or removing the link will result in your link from us being dropped and, potentially, your whole site being banned. |
|
|